πŸ‘©β€πŸ’» 17683. 방금그곑

@Seongukbaek Posted May 24, 2022 Β· Updated May 24, 2022 Β· 3 min read

문제

Programmers - 방금그곑

πŸ“ Logic

// #이 λ“€μ–΄κ°€λŠ” 음 μΉ˜ν™˜ private String convert(String s) { return s.replace("C#", "c").replace("D#", "d").replace("F#", "f").replace("G#", "g").replace("A#", "a"); }
  • # 이 λ“€μ–΄κ°€λŠ” 경우 contains() 둜 포함 μ—¬λΆ€ 확인 μ‹œ μΆ”κ°€ 쑰건이 ν•„μš”ν•΄μ„œ μΉ˜ν™˜ν•˜λŠ” 방식을 μ‚¬μš©ν–ˆλ‹€.
String answer = ""; for (Map.Entry<String, String> entry : music.entrySet()) { String score = entry.getValue(); int playTime = score.length(); // κΈ°μ–΅ν•œ λ©œλ‘œλ””λ₯Ό ν¬ν•¨ν•˜κ³ , μž¬μƒ μ‹œκ°„μ΄ 제일 κΈ΄ μŒμ•…μΈ 경우 answer에 ν•΄λ‹Ή 제λͺ© μ €μž₯ if (score.contains(m) && playTime > maxPlayTime) { answer = entry.getKey(); maxPlayTime = playTime; } }
  • LinkedHashMap 에 λ“€μ–΄μžˆλŠ” 악보λ₯Ό κΈ°μ–΅ν•˜κ³  μžˆλŠ” λ©œλ‘œλ””μ™€ λΉ„κ΅ν•˜λ©΄μ„œ,

    • ν•΄λ‹Ή λ©œλ‘œλ“œλ₯Ό ν¬ν•¨ν•˜κ³ ,
    • μž¬μƒ μ‹œκ°„μ΄ 제일 κΈ΄ μŒμ•…μΈμ§€λ₯Ό νŒλ‹¨ν•˜μ—¬ λ…Έλž˜ 제λͺ©μ„ μ €μž₯ν•œλ‹€.

πŸ“„ CODE

μ½”λ“œ 보기/μ ‘κΈ°πŸ’«
import java.util.*; class JustNowMusic { // Map의 μˆœμ„œ 보μž₯을 μœ„ν•΄ LinkedHashMap μ‚¬μš© LinkedHashMap<String, String> music; public JustNowMusic(String[] musicinfos) { music = new LinkedHashMap<>(); for (String mi : musicinfos) initMusic(mi); } private void initMusic(String mi) { String[] info = mi.split(","); int runTime = parsing(info[0], info[1]); StringBuilder score = new StringBuilder(); info[3] = convert(info[3]); // μž¬μƒ μ‹œκ°„λ§ŒνΌ 악보 반볡 for (int i = 0, idx = 0; i < runTime; i++) { if (i % info[3].length() == 0) idx = 0; score.append(info[3].charAt(idx)); idx++; } // 제λͺ©κ³Ό 악보λ₯Ό Map에 μ €μž₯ music.put(info[2], score.toString()); } // #이 λ“€μ–΄κ°€λŠ” 음 μΉ˜ν™˜ private String convert(String s) { return s.replace("C#", "c").replace("D#", "d").replace("F#", "f").replace("G#", "g").replace("A#", "a"); } private int parsing(String info1, String info2) { int startTime = getTime(info1); int endTime = getTime(info2); return endTime - startTime; } private int getTime(String info) { String[] time = info.split(":"); int hour = Integer.parseInt(time[0]); int min = Integer.parseInt(time[1]); return hour * 60 + min; } public String findMusic(String m) { m = convert(m); int maxPlayTime = -1; String answer = ""; for (Map.Entry<String, String> entry : music.entrySet()) { String score = entry.getValue(); int playTime = score.length(); // κΈ°μ–΅ν•œ λ©œλ‘œλ””λ₯Ό ν¬ν•¨ν•˜κ³ , μž¬μƒ μ‹œκ°„μ΄ 제일 κΈ΄ μŒμ•…μΈ 경우 answer에 ν•΄λ‹Ή 제λͺ© μ €μž₯ if (score.contains(m) && playTime > maxPlayTime) { answer = entry.getKey(); maxPlayTime = playTime; } } return maxPlayTime == -1? "(None)" : answer; } } class Solution { public String solution(String m, String[] musicinfos) { JustNowMusic jnm = new JustNowMusic(musicinfos); return jnm.findMusic(m); } }

✏️ Review

  • μž¬μƒ μ‹œκ°„ 쑰건을 κ³ λ €ν–ˆμ–΄μ•Ό ν•˜λŠ” λ¬Έμ œμ˜€κ³ , κ΅¬ν˜„ν•΄λ‚˜κ°€λ˜ 쀑 계속 λ°œμƒν•˜λŠ” μ‹€νŒ¨λ•Œλ¬Έμ— 질문 κ²Œμ‹œνŒμ„ ν™•μΈν–ˆλŠ”λ°, Map 을 for 문으둜 νƒμƒ‰ν•˜κ²Œ 되면 μˆœμ„œκ°€ 보μž₯λ˜μ§€ μ•ŠλŠ”λ‹€λŠ” 점을 κΉ¨λ‹¬μ•˜λ‹€. LinkedHashMap 을 정리해놓고 μ μš©ν•΄λ³΄μ§€ λͺ»ν•œ μ‚¬λ‘€μ˜€λ‹€.
@Seongukbaek
배우고 μ •λ¦¬ν•˜κ³  κ³΅μœ ν•˜λŠ” λŒ€ν•™μƒ λ°±μ„±μš±μž…λ‹ˆλ‹€ πŸ˜€